Syntactic analysis of η-expansions in Pure Type Systems

Erasability Analysis for Pure Type Systems

Erasure Pure Type Systems are an extension to Pure Type Systems with an erasure semantics. Erasure is guided by lightweight annotations that may be supplied by either a programmer or a prior automatic program analysis phase. We present an algorithm for automatic erasure annotation, generating annotations that are optimal in the sense of marking as much of a program for erasure as possible. We r...

analysis of power in the network society

اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...

Parameters in Pure Type Systems

In this paper we study the addition of parameters to typed -calculus with definitions. We show that the resulting systems have nice properties and illustrate that parameters allow for a better fine-tuning of the strength of type systems as well as staying closer to type systems used in practice in theorem provers and programming languages. 1 What are parameters? Parameters occur when functions ...

Pure Type Systems with

Pure Type Systems Formalized

This paper is about our hobby. For us, machine-checked mathematics is a passion, and constructive type theory (in the broadest sense) is the way to this objective. Efficient and correct type-checking programs are necessary, so a formal theory of type systems leading to verified type synthesis algorithms is a natural goal. For over a year the second author has been developing a machine-checked p...